Mapping of Pruned Tree-Structured Scalar Quantizers to Companding: A Design Strategy
نویسنده
چکیده
Pruned tree-structured scalar quantizers are a form of non-uniform scalar quantizer that are named due to being designed via pruning a tree-structured scalar quantizer [1]. If designed via pruning a uniform tree-structured scalar quantizer, such a quantizer may be mapped to a piecewise linear compandor. An algorithm has been developed for mapping a piecewise linear compandor onto a a tree-structured quantizer with uniform decision thresholds. The method for designing piecewise linear compandors was described b y Swaszek and Thomas [2 ], among others. Using the method for design of piecewise linear compandors and the mapping of a compandor onto a tree-structured quantizer provides a linear time method for the design of pruned tree-structured scalar quantizers. The complexity of the algorithm and and the nature of the required side information raise in teresting possibilities in coder design. There is also the potential for the development of an algorithm which provides for mapping a piecewise linear compandor design to a non-uniform tree-structured quantizer with a more general structure. In addition, considering non-uniform successive re nement quantizers in terms of companding provides potentially useful insights into other aspects of bit-plane coder design.
منابع مشابه
Optimal designing scalar quantizers using a hybrid quantization method for the Laplacian source
This paper proposes new method for designing scalar quantizers. The proposed method, denoted as hybrid method, combines two quantization techniques, the companding technique and the Lloyd-Max's algorithm. In this paper an exact and complete analysis of the hybrid quantization method considering the Laplacian input signals is carried out. Furthermore, two approaches to the problem of finding the...
متن کاملDesign of Fixed and Adaptive Companding Quantizer with Variable-Length Codeword for Memoryless Gaussian Source
The problem we address in this paper is the design of a quantizer that in comparison to the classical fixed-rate scalar quantizers provides more sophisticated bit rate reduction while restricting the class of quantizers to be scalar. We propose a switched variable-length code (VLC) optimal companding quantizer composed of two optimal companding scalar quantizers, the inner and the outer one, bo...
متن کاملJoint Optimization of Scalar and Tree-structured Quantization of Wavelet Image Decompositions
Wavelet image decompositions generate a tree-structured set of coeecients, providing an hierarchical data-structure for representing images. While early wavelet-based algorithms for image compression concentrated on optimal quantization of wavelet coee-cients, several recent researchers have proposed approaches which couple coeecient quantization (either scalar or vector-based) with various str...
متن کاملOn The Complexity of Optimal Tree Pruning for Source Coding
Tree-structured vector quantization (VQ) is a technique to represent a codebook that simplifies encoding as well as quantizer design. Most design algorithms for tree-structured VQ used in the past are based on heuristics that successively partition the input space. Recently, Chou, Lookabaugh, and Gray proposed a tree pruning heuristic in which a given initial tree is pruned backwards according ...
متن کاملSimple Solution for Designing the Piecewise Linear Scalar Companding Quantizer for Gaussian Source
To overcome the difficulties in determining an inverse compressor function for a Gaussian source, which appear in designing the nonlinear optimal companding quantizers and also in the nonlinear optimal companding quantization procedure, in this paper a piecewise linear compressor function based on the first derivate approximation of the optimal compressor function is proposed. We show that the ...
متن کامل